Sunflowers in Set Systems of Bounded Dimension
نویسندگان
چکیده
Given a family $${\mathcal {F}}$$ of k-element sets, $$S_1,\ldots ,S_r\in {\mathcal form an r-sunflower if $$S_i \cap S_j =S_{i'} S_{j'}$$ for all $$i \ne j$$ and $$i' j'$$ . According to famous conjecture Erdős Rado (JAMA 35: 85–90, 1960), there is constant $$c=c(r)$$ such that $$|{\mathcal {F}}|\ge c^k$$ , then contains r-sunflower. We come close proving this families bounded Vapnik-Chervonenkis dimension, $$\text {VC-dim}({\mathcal {F}})\le d$$ In case, we show r-sunflowers exist under the slightly stronger assumption 2^{10k(dr)^{2\log ^{*} k}}$$ Here, $$\log ^*$$ denotes iterated logarithm function. also verify Erdős-Rado Littlestone dimension some geometrically defined set systems.
منابع مشابه
A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter Dimension
Let (X, S) be a set system on an n-point set X . The discrepancy of S is defined as the minimum of the largest deviation from an even split, over all subsets of S ∈ S and two-coloringsχ on X . We consider the scenario where, for any subset X ′ ⊆ X of size m ≤ n and for any parameter 1 ≤ k ≤ m, the number of restrictions of the sets of S to X ′ of size at most k is only O(m1k1), for fixed intege...
متن کاملSet Systems of Bounded Vapnik-Chervonenkis Dimension and a Relation to Arrangements
1 Introduction A classical problem in combinatorial geometry is to find a combinatorial characterization of arrangements of hyperplanes (or configurations of points, which are dual to arrangements, as we will see in chapter 1), i.e. establish a scheme that maps the infinite number of arrangements into finitely many classes in such a way that arrangements with the same image can be regarded as e...
متن کاملHistoric set carries full hausdorff dimension
We prove that the historic set for ratio of Birkhoff average is either empty or full of Hausdorff dimension in a class of one dimensional non-uniformly hyperbolic dynamical systems.
متن کاملShattering-Extremal Set Systems of VC Dimension at most 2
We say that a set system F ⊆ 2[n] shatters a given set S ⊆ [n] if 2S = {F ∩ S : F ∈ F}. The Sauer inequality states that in general, a set system F shatters at least |F| sets. Here we concentrate on the case of equality. A set system is called shattering-extremal if it shatters exactly |F| sets. In this paper we characterize shattering-extremal set systems of Vapnik-Chervonenkis dimension 2 in ...
متن کاملTight bounds on the maximum size of a set of permutations with bounded VC-dimension
The VC-dimension of a family P of n-permutations is the largest integer k such that the set of restrictions of the permutations in P on some k-tuple of positions is the set of all k! permutation patterns. Let rk(n) be the maximum size of a set of n-permutations with VCdimension k. Raz showed that r2(n) grows exponentially in n. We show that r3(n) = 2 Θ(n logα(n)) and for every t ≥ 1, we have r2...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 2023
ISSN: ['0209-9683', '1439-6912']
DOI: https://doi.org/10.1007/s00493-023-00012-z